On Descriptive Complexity , Language Complexity , andGB 1

We introduce L2K;P , a monadic second-order language for reasoning about trees which characterizes the strongly Context-Free Languages in the sense that a set of nite trees is de nable in L2K;P i it is (modulo a projection) a Local Set|the set of derivation trees generated by a CFG. This provides a exible approach to establishing language-theoretic complexity results for formalisms that are based on systems of well-formedness constraints on trees. We demonstrate this technique by sketching two such results for Government and Binding Theory. First, we show that free-indexation, the mechanism assumed to mediate a variety of agreement and binding relationships in GB, is not de nable in L2K;P and therefore not enforcible by CFGs. Second, we show how, in spite of this limitation, a reasonably complete GB account of English can be de ned in L2K;P . Consequently, the language licensed by that account is strongly context-free. We illustrate some of the issues involved in establishing this result by looking at the de nition, in L2K;P , of chains. The limitations of this de nition provide some insight into the types of natural linguistic principles that correspond to higher levels of language complexity. We close with some speculation on the possible signi cance of these results for generative linguistics.